Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
نویسندگان
چکیده
Graphs (networks) are an important tool to model data in different domains. Realworld graphs usually directed, where the edges have a direction and they not symmetric. Betweenness centrality is index widely used analyze networks. In this paper, first given directed network G vertex r ∈ V (G), we propose exact algorithm compute betweenness score of r. Our pre-computes set ℛ
منابع مشابه
Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
Graphs (networks) are an important tool to model data in different domains, including social networks, bioinformatics and the world wide web. Most of the networks formed in these domains are directed graphs, where all the edges have a direction and they are not symmetric. Betweenness centrality is an important index widely used to analyze networks. In this paper, first given a directed network ...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملEfficient algorithms for updating betweenness centrality in fully dynamic graphs
Betweenness centrality of a vertex (edge) in a graph is a measure for the relative participation of the vertex (edge) in the shortest paths in the graph. Betweenness centrality is widely used in various areas such as biology, transportation, and social networks. In this paper, we study the update problem of betweenness centrality in fully dynamic graphs. The proposed update algorithm substantia...
متن کاملEfficient Approximate Computation of Betweenness Centrality
Betweenness Centrality (BC) is a powerful metric for identifying central nodes in complex network analysis, but its computation in large and dynamic systems is costly. Most of the previous approximations for computing BC are either restricted to only one type of networks, or are too computationally inefficient to be applied to large or dynamically changing networks. We explore two approximative...
متن کاملFast exact and approximate computation of betweenness centrality in social networks
Social networks have demonstrated in the last few years to be a powerful and flexible concept useful to represent and analyze data emerging from social interactions and social activities. The study of these networks can thus provide a deeper understanding of many emergent global phenomena. The amount of data available in the form of social networks is growing by the day. This poses many computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2021
ISSN: ['1875-8681', '0169-2968']
DOI: https://doi.org/10.3233/fi-2021-2071